The New Triangulation-Simplify Algorithm of TIN
نویسندگان
چکیده
Simplification of triangulation structure plays an important role in constructing three-dimensional modeling. In this paper, we study all of triangulation-simplify algorithm in use these days, and introduce an algorithm which is very useful in many areas, named TIN simplification based on Vertex Decimation, to actual simplification of three-dimensional terrain. For the huge data of three-dimensional terrain, authors introduce a new algorithm and make it more efficient.
منابع مشابه
Fast Polygonal Approximation of Terrains and Height Fields
Several algorithms for approximating terrains and other height fields using polygonal meshes are described, compared, and optimized. These algorithms take a height field as input, typically a rectangular grid of elevation data H(x, y), and approximate it with a mesh of triangles, also known as a triangulated irregular network, or TIN. The algorithms attempt to minimize both the error and the nu...
متن کاملSimplifying Triangulations of S
In this paper we describe a procedure to simplify any given triangulation of S using Pachner moves. We obtain an explicit exponential-type bound on the number of Pachner moves needed for this process. This leads to a new recognition algorithm for the 3-sphere.
متن کاملSimplifying Triangulations of S 3
In this paper we describe a procedure to simplify any given triangulation of S 3 using Pachner moves. We obtain an explicit exponential-type bound on the number of Pachner moves needed for this process. This leads to a new recognition algorithm for the 3-sphere.
متن کاملAn Improved TIN Compression Using Delaunay Triangulation
In this paper we introduce a new compression technique for the connectivity of a Triangulated Irregular Network (TIN) by using Delaunay triangulation. The strategy in this paper is based on that most of 2.5 dimensional terrain connection are very similar to plane-projected Delaunay triangulation of their vertex set. We only need to keep the vertex coordinates and a few edges that are not includ...
متن کاملSimplifying triangulations
We give a new algorithm to simplify a given triangulation with respect to a given curve. The simplification uses flips together with powers of Dehn twists in order to complete in polynomial time in the bit-size of the curve. keywords. triangulations of surfaces, flip graphs, Dehn twists Mathematics Subject Classification (2010): 57M20
متن کامل